a fast algorithm for exonic regions prediction in dna sequences

نویسندگان

hamidreza saberkari

mousa shamsi

hamed heravi

mohammad hossein sedaaghi

چکیده

the main purpose of this paper is to introduce afast method for gene prediction in dna sequences based on the period-3 property in exons. first, the symbolic dna sequences are converted to digital signal using the eiip method. then, to reduce the effect of background noise in the period-3 spectrum, we use the discrete wavelet transform (dwt) at three levels and apply it on the input digital signal. finally, the goertzel algorithm is used to extract period-3 components in the filtered dna sequence. the proposed algorithm leads to increase the speed of process and therefor reduce the computational complexity. detection of small size exons in dna sequences, exactly, is another advantage of our algorithm. the proposed algorithm ability in exon prediction is compared with several existing methods at the nucleotide level using: (i) specificity - sensitivity values; (ii) receiver operating curves (roc); and (iii) area under roc curve. simulation results show that our algorithm increases the accuracy of exon detection relative to other methods for exon prediction.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm for Exonic Regions Prediction in DNA Sequences

The main purpose of this paper is to introduce a fast method for gene prediction in DNA sequences based on the period-3 property in exons. First, the symbolic DNA sequences were converted to digital signal using the electron ion interaction potential method. Then, to reduce the effect of background noise in the period-3 spectrum, we used the discrete wavelet transform at three levels and applie...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

gpaligner: a fast algorithm for global pairwise alignment of dna sequences

bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...

متن کامل

An Efficient Algorithm for Small Gene Prediction in DNA Sequences

ISSN: 2186-1390 http://cennser.org/IJCVSP Abstract The main purpose of this paper is to introduce a new method for gene prediction in DNA sequences based on the period-3 property in exons. First, the symbolic DNA sequences converted to digital signal by using maximum homogeny estimation modeling method. Then, to reduce the effect of background noise in the period-3 spectrum, we have used the di...

متن کامل

Fast Discerning Repeats in DNA Sequences with a Compression Algorithm

Long direct repeats in genomes arise from molecular duplication mechanisms like retrotransposition, copy of genes, exon shu ing, . . . Their study in a given sequence reveals its internal repeat structure as well as part of its evolutionary history. Moreover, detailed knowledge about the mechanisms can be gained from a systematic investigation of repeats. The problem of nding such repeats is vi...

متن کامل

A Greedy Algorithm for Aligning DNA Sequences

For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy alignment algorithm with particularly good performance and show that it computes the same alignmen...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of medical signals and sensors

جلد ۳، شماره ۳، صفحات ۰-۰

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023